منابع مشابه
The diameter game
In a generalized Maker-Breaker positional game, Maker and Breaker play in turns. Maker makes a moves in each turn and Breaker makes b moves in each turn. We choose Maker to be the first player, although this nearly always makes no difference in the outcome of the game. We call such games (a : b)-games. If a = b, the game is fair, otherwise it is biased. If a = b > 1, the game is accelerated. In...
متن کاملThe Picker-Chooser diameter game
Positional Games are played under several rules on the same hypergraph. We consider some intriguing connection among the outcome of the Maker-Breaker and the Picker-Chooser versions. The later ones were introduced by Beck in [5] and proved to be important in understanding Positional Games in general. Beck had the profound conjecture that playing on the same hypergraph, Picker has better chances...
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملImpact of individual characteristics on sonographic IVC diameter and the IVC diameter/aorta diameter index.
BACKGROUND The inferior vena cava (IVC) parameters, including its diameter and collapsibility index have been evaluated for fluid status for over 30 years, but little is known about the impacts of patient characteristics on IVC parameters. The purpose of this study was to explore the relationships between individual patient characteristics and IVC parameters in healthy Chinese adult volunteers....
متن کاملRandom-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to minimize the number of messages communicated among processors per critical section. Understanding the behavior of tree diameter is useful, for example, in determining an upper bound on the expected number of links bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2009
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20280